Quantitative inconsistent feasibility for averaged mappings
نویسندگان
چکیده
Bauschke and Moursi have recently obtained results that implicitly contain the fact composition of finitely many averaged mappings on a Hilbert space approximate fixed points also has thus is asymptotically regular. Using techniques proof mining, we analyze their arguments to obtain effective uniform rates asymptotic regularity.
منابع مشابه
Averaged Mappings and the Gradient-Projection Algorithm
It is well known that the gradient-projection algorithm (GPA) plays an important role in solving constrained convex minimization problems. In this article, we first provide an alternative averaged mapping approach to the GPA. This approach is operator-oriented in nature. Since, in general, in infinite-dimensional Hilbert spaces, GPA has only weak convergence, we provide two modifications of GPA...
متن کاملHard-constrained inconsistent signal feasibility problems
We consider the problem of synthesizing feasible signals in a Hilbert space in the presence of inconsistent convex constraints, some of which must imperatively be satisfied. This problem is formalized as that of minimizing a convex objective measuring the amount of violation of the soft constraints over the intersection of the sets associated with the hard ones. The resulting convex optimizatio...
متن کاملThe Cyclic Douglas–rachford Method for Inconsistent Feasibility Problems
We analyse the behaviour of the newly introduced cyclic Douglas–Rachford algorithm for finding a point in the intersection of a finite number of closed convex sets. This work considers the case in which the target intersection set is possibly empty. 1. Preliminaries and Notation Throughout we assume H is a (real) Hilbert space with inner product 〈·, ·〉 and induced norm ‖ · ‖. We use → (resp. w....
متن کاملSplit feasibility problems for total quasi-asymptotically nonexpansive mappings
The purpose of this paper is to propose an algorithm for solving the split feasibility problems for total quasi-asymptotically nonexpansive mappings in infinite-dimensional Hilbert spaces. The results presented in the paper not only improve and extend some recent results of Moudafi [Nonlinear Anal. 74:4083-4087, 2011; Inverse Problem 26:055007, 2010], but also improve and extend some recent res...
متن کاملA Hybrid Gradient-Projection Algorithm for Averaged Mappings in Hilbert Spaces
It is well known that the gradient-projection algorithm GPA is very useful in solving constrained convex minimization problems. In this paper, we combine a general iterative method with the gradient-projection algorithm to propose a hybrid gradient-projection algorithm and prove that the sequence generated by the hybrid gradient-projection algorithm converges in norm to a minimizer of constrain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2021
ISSN: ['1862-4480', '1862-4472']
DOI: https://doi.org/10.1007/s11590-021-01812-2